Recent Advances in Practical Data Reduction

Abstract Over the last two decades, significant advances have been made in design and analysis of fixed-parameter algorithms for a wide variety graph-theoretic problems. This has resulted an algorithmic toolbox that is by now well-established. However, these theoretical ideas received very little attention from practical perspective. We survey recent trends data reduction engineering results selected Moreover, we describe concrete techniques may be useful future implementations area give open problems research questions.